A spectral approach to consecutive pattern-avoiding permutations
نویسندگان
چکیده
منابع مشابه
A spectral approach to consecutive pattern-avoiding permutations
We consider the problem of enumerating permutations in the symmetric group on n elements which avoid a given set of consecutive pattern S, and in particular computing asymptotics as n tends to infinity. We develop a general method which solves this enumeration problem using the spectral theory of integral operators on L([0, 1]m), where the patterns in S has length m + 1. Krĕın and Rutman’s gene...
متن کاملAvoiding consecutive patterns in permutations
The number of permutations that do not contain, as a factor (subword), a given set of permutations Π is studied. A new treatment of the case Π = {12 · · · k} is given and then some numerical data is presented for sets Π consisting of permutations of length at most 4. Some large sets of Wilf-equivalent permutations are also given.
متن کاملAlternating, Pattern-Avoiding Permutations
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set Sn(132) of 132-avoiding permutations and the set A2n+1(132) of alternating, 132avoiding permutations. For every set p1, . . . , pk of patterns and certain related patterns q1, . . . , qk, our bijection restricts to a bijection between Sn(...
متن کاملPattern Avoiding Permutations
We establish a bijection from the set of all permutations (of a given length) that avoid a pattern q and a context-sensitive language.
متن کاملPattern-Avoiding Permutations
are three distinct patterns. The first is known as a classical pattern (dashes in all − 1 slots); the third is also known as a consecutive pattern (no dashes in any slots). Some authors call ̃ a “generalized pattern” and use the word “pattern” exclusively for what we call “classical patterns”. Let = 1 2 · · · be a permutation on {1 2 }, where ≥ . We say that contains ̃...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2011
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2011.v2.n3.a1